منابع مشابه
Hierarchical Search for Word Alignment
We present a simple yet powerful hierarchical search algorithm for automatic word alignment. Our algorithm induces a forest of alignments from which we can efficiently extract a ranked k-best list. We score a given alignment within the forest with a flexible, linear discriminative model incorporating hundreds of features, and trained on a relatively small amount of annotated data. We report res...
متن کاملHierarchical Sub-sentential Alignment with Anymalign
We present a sub-sentential alignment algorithm that relies on association scores between words or phrases. This algorithm is inspired by previous work on alignment by recursive binary segmentation and on document clustering. We evaluate the resulting alignments on machine translation tasks and show that we can obtain state-ofthe-art results, with gains up to more than 4 BLEU points compared to...
متن کاملAlignment of Multiple ConfigurationsUsing Hierarchical Models
We describe a method for aligning multiple unlabelled configurations simultaneously. Specifically, we extend the two-configuration matching approach of Green and Mardia (2006) to the multiple configuration setting. Our approach is based on the introduction of a set of hidden locations underlying the observed configuration points. A Poisson process prior is assigned to these locations, resulting...
متن کاملHierarchical alignment of weighted directed acyclic graphs
In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These structural relationships defined by the hierarchy in the graphs act as a constraint on the alignment. In this paper, we formalize this problem as the weighted alignm...
متن کاملMultiple sequence alignment with hierarchical clustering.
An algorithm is presented for the multiple alignment of sequences, either proteins or nucleic acids, that is both accurate and easy to use on microcomputers. The approach is based on the conventional dynamic-programming method of pairwise alignment. Initially, a hierarchical clustering of the sequences is performed using the matrix of the pairwise alignment scores. The closest sequences are ali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of American Linguistics
سال: 2009
ISSN: 0020-7071,1545-7001
DOI: 10.1086/650552